منابع مشابه
Item-Basket Revenue Maximization
Setting prices for items is difficult because one needs to look at prices other substitutable as well as complimentary items. In a co-purchasing network, co-occurence of items can be exploited to tweak item prices for revenue maximization. In our report, we investigate the effects of co-occurrence of items on their prices. In general this problem seems to be NP-Hard. We propose heuristics based...
متن کاملX Revenue Maximization with Nonexcludable Goods
We consider the design of revenue maximizing auctions for nonexcludable public goods. In particular, we consider auctions in Bayesian settings for facility location problems on graphs. Edges represent sites for facilities (e.g., roads, communication links) to be constructed. Each agent represents a pair of nodes in the graph, and he derives some nonnegative private value drawn from a known dist...
متن کاملDynamic revenue maximization: A continuous time approach
We characterize the profit-maximizing mechanism for repeatedly selling a non-durable good in continuous time. The valuation of each agent is private information and changes over time. At the time of contracting every agent privately observes his initial type which influences the evolution of his valuation process. In the profit-maximizing mechanism the allocation is distorted in favor of agents...
متن کاملRevenue Maximization via Nash Implementation
We consider the problem of maximizing revenue in prior-free auctions for general single parameter settings. The setting is modeled by an arbitrary downward-closed set system, which captures many special cases such as single item, digital goods and single-minded combinatorial auctions. We relax the truthfulness requirement by the solution concept of Nash equilibria. Implementation by Nash equili...
متن کاملRevenue Maximization in Online Dial-A-Ride
We study a variation of the Online-Dial-a-Ride Problem where each request comes with not only a source, destination and release time, but also has an associated revenue. The server’s goal is to maximize its total revenue within a given time limit, T . We show that the competitive ratio is unbounded for any deterministic online algorithm for the problem. We then provide a 3-competitive algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Games and Economic Behavior
سال: 2015
ISSN: 0899-8256
DOI: 10.1016/j.geb.2014.03.011